منابع مشابه
Automatically Proving Up-to Bisimulation
RRsumm Nous ddveloppons diverses mmthodes permettant d'automatiser des preuves de bisimulation up-too pour le-calcul. Nous traitons les techniques congruence structurelle prrss (par l'intermmdiaire de la dddnition d'un algorithme calculant une forme normale unique pour la congruence structurelle), substitutions injectives sur les noms li-bres prrss, restriction prrss, et composition paralllle p...
متن کاملProving Linearizability via Branching Bisimulation
Linearizability and progress properties are key correctness notions for concurrent objects. However, model checking linearizability has suffered from the PSPACE-hardness of the trace inclusion problem. This paper proposes to exploit branching bisimulation, a fundamental semantic equivalence relation developed for process algebras which can be computed efficiently, in checking these properties. ...
متن کاملAutomatically Proving Linearizability
This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure implementations. The procedure employs a novel instrumentation to verify logically pure executions, and is evaluated on a number of standard concurrent stack, queue and set algorithms.
متن کاملProving Innermost Normalisation Automatically
We present a technique to prove innermost normalisation of term rewriting systems (TRSs) automatically. In contrast to previous methods, our technique is able to prove innermost normalisation of TRSs that are not terminating. Our technique can also be used for termination proofs of all TRSs where innermost normalisation implies termination, such as non-overlapping TRSs or locally con uent overl...
متن کاملProving Equality of Streams Automatically
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. In this paper we focus on equality of streams, more precisely, for a given set of equations two stream terms are said to be equal if they are equal in every model satisfying the given equations. We investigate techniques for proving equality of streams suitable for au...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80251-8